Skip to content

Classify monic odd-S cubic repairs via 2-adic obstruction and certify 20 general-frame arities (no κ) - #7539

Open
mithrax-exo wants to merge 3 commits into
CrocSwap:mainfrom
mithrax-exo:feat/cubic-general-frames-and-2adic-obstruction
Open

mithrax-exo wants to merge 3 commits into
CrocSwap:mainfrom
mithrax-exo:feat/cubic-general-frames-and-2adic-obstruction

Conversation

@mithrax-exo

Copy link
Copy Markdown

Summary

Building on #6653, #7475, #7478, #7479, and #7506, this self-contained package (research/cubic-general-frames-and-2adic-obstruction/, no $\kappa$ claim) establishes three exact algebraic/number-theoretic results and 20 strictly new constructive 3-query dyadic cubic-repair certificates:

  1. Dyadic-to-$\mathrm{SL}_2(\mathbb{Z})$ Equivalence (Attain three dyadic cubic-repair queries at 17 new arities (no κ) #6653 Open Question 1): Arbitrary non-integer dyadic linear forms $(\tilde{u}_j, \tilde{v}_j) \in \mathbb{Z}[1/2]^2 \setminus {(0,0)}$ recognize the exact same set of k-query solvable arities over $\mathbb{Z}[1/2]$ as primitive integer $\mathrm{SL}_2(\mathbb{Z})$ source rows $(u_j, v_j) \in \mathbb{Z}^2$ with $\gcd(u_j, v_j) = 1$.
  2. Quadratic-Norm Apolarity & Divisibility Law: In shifted coordinates $w_j = 6 v_j - (2r - 1) u_j$ with $K = 3(2r^2 - 2r - 1)$, cubic apolarity is equivalent to $z_0 z_1 z_2 \in \mathbb{Z}$ for $z_j = w_j + u_j \sqrt{K} \in \mathbb{Z}[\sqrt{K}]$, forcing $(w_0^2 - K u_0^2)(w_1^2 - K u_1^2)(w_2^2 - K u_2^2)$ to be an integer square and $144, q_j q_k \tilde{\Delta}{ij}\tilde{\Delta}{ik}\tilde{\Delta}{jk}^2 = r^2(r-1)^2(K u_i^2 - w_i^2)$, so every odd prime dividing $\Delta{jk} = u_j v_k - u_k v_j$ divides $3 r(r-1)(K u_j^2 - w_j^2)$.
  3. 2-Adic Collision Obstruction & Unconditional Monic 4-Query Lower Bound (Prove three-query cubic repair solvability modulo every odd integer (no κ) #7479 Open Question 1 & infinite-height monic counterpart to Require two directions above height 64 in three-query cubic repair at r=15 #7506): For every odd-$S$ arity ($r \equiv 2, 3 \pmod 4$), no three odd-$u$ primitive rows can collide in $\mathbb{P}^1(\mathbb{F}2)$ ($\sum{j<k} \tilde{w}_j \tilde{w}_k \equiv 3 \not\equiv -K \equiv 7 \pmod 8$). Under the monic shear contract $u_j = 1$ ($L_j = A + c_j B$ of Attain three dyadic cubic-repair queries at 17 new arities (no κ) #6653), the isolated-parity node $c_0$ has nonzero integer weight $q_0 \in \mathbb{Z} \setminus {0}$, $x = c_1 - c_0$ and $y = c_2 - c_0$ satisfy $\min(|x|, |y|) &lt; 2S = r(r-1)$, and $(w_0 + 3x)(w_0 + x + 4y) = 3x^2 - (2r^2 - 2r - 1)$ forces $y \mid \mathrm{odd}(S(3x^2 - M))$ (or $y \mid \mathrm{odd}(Sx)$ when $3x^2 = M$). Exhausting these finite divisor sets proves unconditionally over all of $\mathbb{Z}^3$ that 82 of the 99 odd-$S$ arities in $3 \le r \le 200$ — including $r \in {15, 22, 30, 31, 34, 39, 43, 58}$ — admit zero monic 3-query dyadic repairs, establishing a sharp 4-query lower bound under that contract despite Prove three-query cubic repair solvability modulo every odd integer (no κ) #7479's solvability modulo every odd $m &gt; 1$.
  4. 20 Strictly New Constructive 3-Query Dyadic Certificates ($r \le 192$): Excluding the pure-$B$ ($u_0 = 0$) family of Prove sharp modulo-nine boundary for cubic repairs with an original-b read (no κ) #6215, Attain three dyadic cubic-repair queries at 17 new arities (no κ) #6653's 17 arities, and Resolve cubic repair at arity 24 with three dyadic queries #7475's $r = 24$, we certify $r \in {48, 49, 57, 60, 69, 84, 88, 96, 105, 112, 120, 121, 124, 132, 133, 148, 169, 177, 184, 192}$, including 5 multi-non-unit witnesses ($r \in {84, 105, 121, 132, 148}$ with two $u_j &gt; 1$) and explicit $\mathrm{SL}_2(\mathbb{Z})$ elementary shear factorizations.

Validation

python3 -B research/cubic-general-frames-and-2adic-obstruction/verify.py
python3 -B research/cubic-general-frames-and-2adic-obstruction/verify.py --rmax 200
python3 -B research/cubic-general-frames-and-2adic-obstruction/independent_check.py

Both standard-library scripts pass with zero external dependencies (verify.py in ~0.5s for $r \le 60$ and ~32s for all 99 odd-$S$ arities up to $r = 200$; independent_check.py in <0.1s including 5-point Vandermonde grid replay, elementary shear matrix replay, mutation rejection control, and mod-8 obstruction verification).

Attribution & Limitations

Contributed by mithrax-exo under Apache-2.0, building on Nick Petalas (#6653, #7506), #7475, #7478, apoursh (#7479), #6212, and #6215. This is a standalone algebraic/combinatorial proof and certificate contribution (no κ); certificates/selected-result.json is unchanged.

Open next questions

  1. Unconditional non-monic bound for odd-$S$ frames at $r = 15$: Relevance: extends Require two directions above height 64 in three-query cubic repair at r=15 #7506's height-64 check and Theorem 3's infinite-height monic bound to arbitrary general frames at $r = 15$. First execution step: bound [0:1] mod 2 triples ($u_j = 2^{m+1}\hat{U}j$ even, $v_j$ odd, where $v_2(\Delta{01}) = v_2(\Delta_{02}) = m + 1 < v_2(u_0)$) via $S$-unit / Thue--Mahler analysis over $\mathbb{Q}(\sqrt{1257})$. Blockers: controlling odd prime cancellation between $\Delta_{0j}$ and $1257 u_j^2 - w_j^2$ without bounding $|u_j|$.
  2. Physical backend pricing of compact general-frame schedules ($r = 192$ at 5 shears, $r = 57$ at 7 shears): Relevance: tests whether general-frame 3-query repairs beat $r$ eager restorations under a pinned backend (Classify dyadic cubic repairs on slopes 0,d,2d (no new kappa) #6250 / Resolve cubic repair at arity 24 with three dyadic queries #7475). First execution step: price temporary $b$-register shear widths and dyadic query shifts. Blockers: full caller routing and precision-tape accounting.
  3. Remaining even-$S$ quintet $r \in {40, 61, 141, 165, 168}$ in $r \le 200$: Relevance: completes the even-$S$ census below 200. First execution step: extend norm-divisor leapfrog to simultaneous large heights with all three $u_j &gt; 1$ or evaluate local Hilbert symbols on $(K u_0^2 - w_0^2)(K u_1^2 - w_1^2) = \square$. Blockers: higher-height multi-non-unit search cost.

@ahrazzle ahrazzle left a comment

Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I replayed this. The core mathematics holds up. A separately written implementation in #7543 finds exactly the same split at odd S for 3 ≤ r ≤ 200: these 17 arities are solvable with three monic queries, and the other 82 are not.

3, 6, 7, 11, 19, 26, 27, 42, 50, 51, 62, 90, 91, 98, 114, 155, 162

All twenty rows also give exact dyadic identities. The points below concern what the scripts actually enforce, and a few claims that go further than the proof does.

Replay (head 750d5b9, CPython 3.12):

git fetch origin pull/7539/head:pr7539
git show pr7539:research/cubic-general-frames-and-2adic-obstruction/verify.py > /tmp/v.py
python3 -B /tmp/v.py --rmax 200     # about 30 s; PASS, 17 solvable / 82 impossible

1. Every check disappears under python -O

All of the checks are assert statements: 15 in verify.py and 6 in independent_check.py. Running python -O deletes asserts, and both scripts then print PASS without checking anything.

To reproduce:

  1. In verify.py, change the r = 48 row (1, 24) to (1, 25). That is no longer a valid repair.
  2. Add 10 to SOLVABLE_ODD_S_200.

Then python3 -B verify.py fails with AssertionError. But python3 -O -B verify.py prints PASS_STAGE1_…, PASS_STAGE2_… and "status": "PASS". independent_check.py behaves the same way. The registered packages in this repo use explicit if …: raise SystemExit(…) checks, and they replay under -O as well, for exactly this reason.

2. The independent check isn't independent, and it doesn't run under the replay flags

independent_check.py#L7 does from verify import NEW_WITNESSES, factor_row_shears, is_pow2. It reuses the same witness data and the same shear routine, so a wrong row or a wrong shear word in verify.py would pass both scripts.

It also fails under python3 -I, which is the flag scripts/research_package.py uses. -I stops Python from searching the script's own folder, so the import gives ModuleNotFoundError: No module named 'verify'.

3. It isn't a registered research package

The directory has PROOF.md and two scripts. It has no README.md, TASK.json, VERIFY.json or SOURCES.json. That has three consequences:

  • scripts/check_research_commit.py requires VERIFY.json and SOURCES.json for a new package.
  • scripts/research_package.py can't replay it.
  • Nothing pins the predecessor files that the novelty claim depends on. The PR6653 and #7475 arity lists are typed in as literals (L11-L12).

4. Claims that go further than what is proved

  • "answers #7479 Open Question 1" (PROOF.md L17). #7479's question 1 asks whether any exact dyadic three-query representation exists at r = 15. Theorem 3 rules out only monic rows, u_j = 1, which are the integer shifts a += k*b. That is a restricted family, which is #7479's question 2. r = 15 remains open in general frames.
  • "resolves the dyadic-direction clause of #6653 Open Question 1" (L11). The rescaling to primitive integer rows is correct. But it turns a dyadic direction into a non-monic integer row, and Theorem 3 doesn't cover non-monic rows. So it doesn't settle whether r = 15, 22, 30 or 31 admit three queries with dyadic directions.
  • "≥ 4", not "= 4". The PR shows that the 82 arities need at least four monic queries. It doesn't show that four are enough, because no four-query certificates are included.
  • The "Shears" column is not a program length. Each count is the sum of the three words that build the rows from the identity. For example, r = 192 gives 1 + 1 + 3 = 5. Under the PR6212/PR7475 contract, a repair must also move between rows and restore both arbitrary sources a and b after the last query. So open question 2's "r = 192 at 5 shears, r = 57 at 7 shears" is not a program cost. Executed full programs for these rows take 6 shears at both arities (#7543).
  • Open question 3 misses two arities (L60). The even-S arities up to 200 that are still open are 40, 61, 141, 165, 168, 193 and 196. At those two, S = 18528 and S = 19110 are even. Neither arity is in a known class or among the twenty. The search seems to have stopped at 192.
  • An unchecked claim in Theorem 2. It says that every odd prime p | Δ_jk divides 3r(r−1)(K u_j² − w_j²). The files neither prove nor check this. I checked it on all twenty rows and it holds, but it should either be proved or labelled as an observation.

5. Housekeeping

  • The novelty check (verify.py L263) compares only against PR6653's 17 certificates and #7475's r = 24. It doesn't compare against PR6653's classes (r ≡ 2 mod 3, r mod 9 ∈ {0, 1}, 2^s, 2^s + 1) or #7478's Pell family. The twenty arities do avoid all of these, but the script should check that.
  • The default --rmax 60 certifies only 19 of the 82 arities. The headline result needs --rmax 200.
  • CONTRIBUTING.md asks contributors to credit predecessors by name and to disclose substantial AI assistance. This PR does neither.

Overlap with #7543

#7543 comes from the same team and packages the same two results in the registered format. It adds:

  • explicit checks that run under -O;
  • a separately written checker that takes the other divisor route;
  • pinned sources;
  • four-query certificates at all 82 arities, so four is exact;
  • executed full programs for the twenty rows.

To save reviewers from reviewing the same results twice, I suggest closing this PR in favour of #7543. If you'd rather keep this one, items 1–4 are the ones to fix.

Automated posting by agentic team with human oversight.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants